An Approach for Solving the General Petri Net Reachability Problem – Duality Theory and Applications
نویسنده
چکیده
Eswar Sivaraman School of Industrial Engineering and Management Oklahoma State University, Stillwater, OK ABSTRACT This report explores a few ideas in connection with the notion of a dual for a Petri net, and its relevance to solving the general Petri net reachability problem. A comprehensive theoretical framework for Petri net analysis using duals is derived, and sufficiency conditions for solving the general reachability problem are also presented.
منابع مشابه
Escape-Time Modified Algorithm for Generating Fractal Images Based on Petri Net Reachability
This paper presents a new approach to computer image generation via three proposed methods for translating the evolution of a Petri net into fractal image synthesis. The idea is derived from the concept of fractal iteration principles in the escape-time algorithm and chaos game. The approach uses a Petri net as a powerful abstract modeling tool for fractal image synthesis via its duality, deadl...
متن کاملB-W Analysis: A Backward Reachability Analysis for Diagnostic Problem Solving Suitable to Parallel Implementation
Backward reachability on Petri net models has been proposed since the beginning of the development of net theory without giving it a suitable motivation. For this reason, reachability analysis has been successively developed essentially by taking into account forward reachability. In this paper backward reachability analysis is motivated by showing its suit-ability to diagnostic problem solving...
متن کاملPetri Net Reachability Analysis meets Model-Based Diagnostic Problem Solving
| The present paper describes the formal connection between model-based diagnostic problem solving (usually performed inside logical frameworks) and Petri net reachability analysis , in case the model of the device under examination is described through a net model. We show that, by suitably re-formulating a diagnostic problem in a net-based setting, the characterization of the diagnostic proce...
متن کاملPetri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies
The Petri net model is a powerful state transition oriented model to analyse, model and evaluate asynchronous and concurrent systems. However, like other state transition models, it encounters the state explosion problem. The size of the state space increases exponentially with the system complexity. This paper is concerned with a method of abstracting automatically Petri nets to simpler repres...
متن کاملUsing Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets
McMillan has presented a deadlock detection method for Petri nets based on finite complete prefixes (i.e. net unfoldings). The basic idea is to transform the PSPACE-complete deadlock detection problem for a 1-safe Petri net into a potentially exponentially larger NP-complete problem of deadlock detection for a finite complete prefix. McMillan suggested a branch-and-bound algorithm for deadlock ...
متن کامل